منابع مشابه
Finding routes in anonymous sensor networks
We consider networks of anonymous sensors and address the problem of constructing routes for the delivery of information from a group of sensors in response to a query by a sink. In order to circumvent the restrictions imposed by anonymity, we rely on using the power level perceived by the sensors in the query from the sink. We introduce a simple distributed algorithm to achieve the building of...
متن کاملFinding large degree-anonymous subgraphs is hard
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k − 1 other vertices with the same degree. We examine the computational complexity of making a given undirected graph k-anonymous either through at most s vertex deletions or through at most s edge deletions; the corresponding problem variants are denoted by Anonym V-Del and Anonym E-Del. We ...
متن کاملInfarcted spinal schwannoma: an unusual MR finding.
We present a case of infarcted schwannoma of the thoracic spine in a patient with acute cord compression. MR images did not enhance after contrast administration, which is highly atypical for schwannoma, but was in keeping with the pathologic findings in this case.
متن کاملInterpeduncular heterotopia in Joubert syndrome: a previously undescribed MR finding.
The so-called molar tooth sign is the radiologic hallmark of JSRD. Joubert syndrome is a rare, most often autosomal-recessive disorder with a characteristic malformation of the midhindbrain. We describe 3 patients with JSRD and the additional MR finding of tissue resembling heterotopia in the interpeduncular fossa, which in one patient was combined with a more extensive intramesencephalic heter...
متن کاملCC-MR - Finding Connected Components in Huge Graphs with MapReduce
The detection of connected components in graphs is a wellknown problem arising in a large number of applications including data mining, analysis of social networks, image analysis and a lot of other related problems. In spite of the existing very efficient serial algorithms, this problem remains a subject of research due to increasing data amounts produced by modern information systems which ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Genetics
سال: 2013
ISSN: 1471-0056,1471-0064
DOI: 10.1038/nrg3439